例句與造句

1. The iteration formula and determination of iteration step are set up according to a priori information of rock and concrete
   建立了考慮先驗(yàn)信息的修正高斯-牛頓算法的迭代格式和迭代步長的確定方法。
2. Some improvement are made on the ground of direct method , such as adding the outer iteration and adopting dynamic convergent criterion to accelerate it , introducing the iteration step factor , adding the flux criterion to main iteration , etc . compared with the other two computation methods , the modified direct method has the advantage of wide calculational range and high precision
   在直接法的基礎(chǔ)上作了幾點(diǎn)改進(jìn)，如引入?yún)?shù)使得主迭代中增加了外迭代并采用動態(tài)收斂判據(jù)加速迭代過程，引入步長調(diào)整因子f ，給主迭代收斂條件增加了通量判據(jù)等。
3. Instead , there needs to store only the original coefficient matrix , some auxiliary matrices for the preconditioner and several vectors in the iteration methods . further , the core of the iteration is the matrix - vector multiplication and the solution of the auxiliary equations corresponding to the preconditioner . if the solution of the auxiliaries spend not very much , the computational cost in each iteration step will be very cheap , due to the fact that the sparsity of the matrix can be exploited sufficiently
   與直接法相比，迭代法只需存儲原系數(shù)矩陣、對應(yīng)于預(yù)處理的幾個輔助矩陣與少量幾個向量，且迭代中除求解輔助線性方程組外，其余的計(jì)算主要是稀疏矩陣與向量乘積，從而能充分利用稀疏性減少計(jì)算量，但迭代法的收斂速度一般與系數(shù)矩陣的譜分布有關(guān)。
4. The second part studies optimal pure proportional navigation ( ppn ) , with time - dependent gain of navigation to maneuvering target based on proportional navigation theory . optimal gain of navigation is constant for ppn without maneuvering ; based on this , solution of time - dependent gain of navigation is given by iteration approach , and the time required for capture is given , the times of iteration is decided by comparing this time with the iteration step
   對目標(biāo)機(jī)動的追逃問題,考慮導(dǎo)航增益可為任意實(shí)數(shù),且隨時間和初始條件改變,這一思想是建立在目標(biāo)非機(jī)動的純比例導(dǎo)引制導(dǎo)規(guī)律,最佳導(dǎo)航增益為常數(shù)的基礎(chǔ)之上,利用迭代的方法,給出了時變的導(dǎo)航增益的求解方法,并給出了實(shí)現(xiàn)捕獲所需的時間,用此時間與迭代步長進(jìn)行比較,判定迭代次數(shù)。
5. On one hand , from the technique of constrained least squares and limited energy of additive noise , an effective restored approach by adopting regularization method to overcoming ill - posed problem , solving an equation with a single variable , and using space iterative algorithm is proposed ; on the other hand , aiming at the restoration of blurred image , another effective restoration approach based on least - square algorithm is also proposed in this paper . this method firstly adopts increment iterative algorithm to improve convergence and meanwhile applies regularization technique to overcome ill - posed problem . in the computations , the regularized parameter has its adaptive character , which can be determined in terms of the restored image at each iteration step therefore automatically correct to the appropriate value
   一是從約束最小二乘出發(fā),在加性噪聲能量有界的前提下,采用正則化方法來克服病態(tài)問題,通過解一個單變量方程,并利用空域迭代運(yùn)算實(shí)現(xiàn)了一種有效的圖像復(fù)原;二是針對模糊圖像的復(fù)原問題,從最小二乘算法出發(fā),采用增量迭代的方法改善算法的收斂性,同時結(jié)合正則化技術(shù)克服問題的病態(tài)性質(zhì),并引入自適應(yīng)的正則化參數(shù),使其與圖像復(fù)原的迭代運(yùn)算同步進(jìn)行并自動修正到最優(yōu)值。
6. It's difficult to find iteration step in a sentence. 用iteration step造句挺難的